On the Size of Shortest Modal Descriptions
نویسندگان
چکیده
We address the problems of separation and description in some fragments of modal logics. The former consists in finding a formula that is true in some given subset of the domain and false in another. The latter is a special case when one separates a singleton from the rest. We are interested in the shortest size of both separations and descriptions. This is motivated by applications in computational linguistics. Lower bounds are given by considering the minimum size of Spoiler’s strategies in the classical Ehrenfeucht-Fräıssé game. This allows us to show that the size of such formulas is not polynomially bounded (with respect to the size of the finite input model). Upper bounds for these problems are also studied. Finally we give a fine hierarchy of succinctness for separation over the studied logics.
منابع مشابه
Effect of family structure on urban areas modal split by using the life cycle concept
The modal split model is one of the steps of the classical four-step travel demand planning. Predictive, descriptive, and prescriptive modal split models are essential to make a balance between travel demand and supply. To calibrate these models, it is necessary to detect and employ influential independent variables that are related to characteristics of travel modes, individual and family attr...
متن کاملModal Characteristics of Composite Beams with Single Delamination- A Simple Analytical Technique
In the present research, the effects of delamination size and location on vibration characteristics of laminated composite beams are investigated both analytically and numerically. In the analytical method, the delaminated beam is modeled as four interconnected Euler–Bernoulli beams and the constrained and free mode models are both simulated. The differential stretching and the bending-extensio...
متن کاملMichael Kremer Marti on Descriptions in Carnap ’ S S 2
This note is a friendly amendment to Marti’s analysis of the failure of Føllesdal’s argument that modal distinctions collapse in Carnap’s logic S2. Føllesdal’s argument turns on the treatment of descriptions. Marti considers how modal descriptions, which Carnap banned, might be handled; she adopts an approach which blocks Føllesdal’s argument, but requires a separate treatment of non-modal desc...
متن کاملFixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph definitions allow to specify graphs of exponential size using polynomial size descriptions. In many cases, this succinctness increases the computational complexity of decision problems. In this paper, the modelchecking pro...
متن کاملEfficient algorithms for the 2-Way Multi Modal Shortest Path Problem
We consider the 2-Way Multi Modal Shortest Path Problem (2WMMSPP). Its goal is to find two multi modal paths with total minimal cost, an outgoing path and a return path. The main difficulty lies in the fact that if a private car or bicycle is used during the outgoing path, it has to be picked up during the return path. The shortest return path is typically not equal to the shortest outgoing pat...
متن کامل